Using VRPSolver to efficiently solve the Differential Harvest Problem

نویسندگان

چکیده

Precision farming in viticulture raises challenging combinatorial issues such as the Differential Harvest Problem . This problem might appear at first similar to a simple Capacitated Vehicle Routing but it exhibits problem-specific constraints that make this much harder solve and which are discussed article. Our objective was develop efficient exact methods using column generation VRPSolver™ based models. In order investigate possibilities of hybridization, two other models were designed: constraint programming model local search LocalSolver™ reach good scalability, new valid inequalities hybrid solving scheme proposed. Extensive experiments performed both on simulated real data sets. The results from operational cost point view also performance. • problems. can be seen complex capacitated vehicle routing problem. Several optimization paradigms implemented, compared hy-bridized. With adequate modeling, VRPSolver used efficiently For time realistic instance with 24 rows solved optimally.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Differential Evolution Method to Solve Crew Rostering Problem

Airline crew rostering is the assignment problem of crew members to planned rotations/pairings for certain month. Airline companies have the monthly task of constructing personalized monthly schedules (roster) for crew members. This problem became more complex and difficult while the aspirations/criterias to assess the quality of roster grew and the constraints increased excessively. This paper...

متن کامل

Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

a r t i c l e i n f o a b s t r a c t The length-constrained heaviest path (LCHP) in a weighted tree T , where each edge is assigned a weight and a length, is the path P in T with maximum total path weight and total path length bounded by a given value B. This paper presents an O (n log n) time LCHP algorithm which utilizes a data structure constructed from the spine decomposition of the input ...

متن کامل

A Constraint-Based Approach to the Differential Harvest Problem

In this paper, we study the problem of differential harvest in precision viticulture. Some recent prototypes of grape harvesting machines are supplied with two hoppers and are able to sort two types of grape quality. Given estimated qualities and quantities on the different areas of the vineyard, the problem is to optimize the routing of the grape harvester under several constraints. The main c...

متن کامل

How Ants Can Efficiently Solve Generalized Watchman Route Problem

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. ...

متن کامل

Exploiting Structure to Efficiently Solve Large Scale

Exploiting Structure to Efficiently Solve Large Scale Partially Observable Markov Decision Processes Pascal Poupart Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2005 Partially observable Markov decision processes (POMDPs) provide a natural and principled framework to model a wide range of sequential decision making problems under uncertainty. To date, the u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2023

ISSN: ['0305-0548', '1873-765X']

DOI: https://doi.org/10.1016/j.cor.2022.106029